The rainbow vertex connection number of ladder graphs and Roach graphs
نویسندگان
چکیده
A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of are connected by a path whose internal have distinct colours. The vertex-connection number G, denoted rvc(G), the smallest colours that needed make vertex-connected. This study focuses on deriving formulas for vertex connectivity simple ladder and roach graph.
منابع مشابه
Rainbow connection number of dense graphs
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we show that rc(G) ≤ 3 if |E(G)| ≥ ( n−2 2 ) + 2, and rc(G) ≤ 4 if |E(G)| ≥ ( n−3 2 ) + 3. These bounds...
متن کاملGraphs with rainbow connection number two
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where (
متن کاملFurther hardness results on the rainbow vertex-connection number of graphs
A vertex-colored graph G is rainbow vertex-connected if any pair of vertices in G are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. In a previous paper we ...
متن کاملThe rainbow connection number of 2-connected graphs
The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove that the rainbow connection number of every 2-connected graph with n vertices is at most dn/2e. The bound is optimal.
متن کاملBounds for the rainbow connection number of graphs
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to makeG rainbowconnected. In this paper we show some new bounds for the rainbow connection number of graphs depending on the minimum degree and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ceylon Journal of Science
سال: 2023
ISSN: ['2513-230X', '2513-2814']
DOI: https://doi.org/10.4038/cjs.v52i3.8045